A Distributed Bandwidth Fair Allocation Algorithm for RPR Networks

Despite the rapid development of the resilient packet ring (RPR) technology, the available bandwidth allocation algorithms for RPR networks do not provide satisfactory solutions to meet their performance requirements. To attack this problem, this paper proposes an algorithm, which we call the distributed bandwidth fair allocation (DBFA) algorithm, that achieves the key RPR performance goals, i.e., fairness, high utilization and spatial reuse. The algorithm is distributed and uses a simple proportional control mechanism to allocate bandwidth among competing flows in a weighted manner. In order to realize global coordination on the entire RPR ring, one global control packet traverses around the ring to make every node on the ring dynamically adjust its sending rate, so it eventually achieves its fair share of the ring bandwidth. As a result, global fairness as well as high utilization and maximal spatial reuse over the RPR ring can be achieved. Simulation results verify the satisfactory performance of the DBFA algorithm.